A continuous-time search model with job switch and jumps

نویسندگان

  • Masahiko Egami
  • Mingxin Xu
چکیده

We study a new search problem in continuous time. In the traditional approach, the basic formulation is to maximize the expected (discounted) return obtained by taking a job, net of search cost incurred until the job is taken. Implicitly assumed in the traditional modeling is that the agent has no job at all during the search period or her decision on a new job is independent of the job situation she is currently engaged in. In contrast, we incorporate the fact that the agent has a job currently and starts searching a new job. Hence we can handle more realistic situation of the search problem. We provide optimal decision rules as to both quitting the current job and taking a new job as well as explicit solutions and proofs of optimality. Further, we extend to a situation where the agent’s current job satisfaction may be affected by sudden downward jumps (e.g. de-motivating events), where we also find an explicit solution; it is rather a rare case that one finds explicit solutions in control problems using a jump diffusion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EPQ model with depreciation cost and process quality cost as continuous functions of time

Extensive research has been devoted to economic production quantity (EPQ) problem. However, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. In this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...

متن کامل

A New model for integrated lot sizing and scheduling in flexible job shop problem

In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

Time-Varying Modeling of Systematic Risk: using High-Frequency Characterization of Tehran Stock Exchange

We decompose time-varying beta for stock into beta for continuous systematic risk and beta for discontinuous systematic risk. Brownian motion is assumed as nature of price movements in our modeling. Our empirical research is based on high-frequency data for stocks from Tehran Stock Exchange. Our market portfolio experiences 136 days out of 243 trading days with jumps which is a considerable rat...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 70  شماره 

صفحات  -

تاریخ انتشار 2009